Source sink flows with capacity installation in batches
نویسندگان
چکیده
منابع مشابه
Source Sink Flows with Capacity Installation in Batches
We consider the problem of sending flow from a source to a destination where there are flow costs on each arc and fixed costs toward the purchase of capacity. Capacity can be purchased in batches of C units on each arc. We show the problem to be NP-hard in general. If d is the quantity to be shipped from the source to the destination, we give an algorithm that solves the problem in time polynom...
متن کاملMinimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V; A), and a set of traac demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer multiples of a base unit) so that traac can be routed. In this paper we consider the problem of minimum cost installation of capacity on the arcs to ensure that the required demands can be shipped simultaneously between n...
متن کاملSINK SINK SOURCE SINK SINK Channel Process C Process
The Internet and the Grid are changing the face of high performance computing. Rather than tightly-coupled SPMD-style components running in a single cluster, on a parallel machine, or even on the Internet programmed in MPI, applications are evolving into sets of cooperating components scattered across diverse computational elements. These components may run on diierent operating systems and har...
متن کاملStudy of Solute Dispersion with Source/Sink Impact in Semi-Infinite Porous Medium
Mathematical models for pollutant transport in semi-infinite aquifers are based on the advection-dispersion equation (ADE) and its variants. This study employs the ADE incorporating time-dependent dispersion and velocity and space-time dependent source and sink, expressed by one function. The dispersion theory allows mechanical dispersion to be directly proportional to seepage velocity. Initial...
متن کاملApproximating the Single-Sink Link-Installation Problem in Network Design
We initiate the algorithmic study of an important but NP hard problem that arises commonly in network design The input consists of An undirected graph with one sink node and multiple source nodes a speci ed length for each edge and a speci ed demand demv for each source node v A small set of cable types where each cable type is speci ed by its capacity and its cost per unit length The cost per ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00024-9